An existence theorem for some simple t-designs
نویسندگان
چکیده
منابع مشابه
An existence theorem for some simple t-designs
Dehon, M., An existence theorem for some simple t-designs, Discrete Mathematics 90 (1991) 137-142. Let S’ be a simple S;(t, k, [) containing b’ blocks and let S be a, not necessarily simple, $(t, 1. u); we prove that if b”(A 1) < (:), then there exists a simple &,(t, k, v). We apply this result to prove the existence of a new infinite family of 5-designs derived from the Alltop’s family of 5-de...
متن کاملSome new families of simple t-designs
Applying some methods of construction on existing i-designs, we obtain some infinite families of new simple designs. We give a table which contains many new simple designs in small cases. The main method which is called the union method, involves taking the union of every two blocks in a given design. We also combine this method with some other well known ones. Some of the new designs obtained ...
متن کاملComputational existence proofs for spherical t-designs
Spherical t-designs provide quadrature rules for the sphere which are exact for polynomials up to degree t. In this paper, we propose a computational algorithm based on interval arithmetic which, for given t, upon successful completion will have proved the existence of a tdesign with (t + 1)2 nodes and will have computed narrow interval enclosures which are known to contain these nodes with mat...
متن کاملAn improved finiteness theorem for graphical t-designs
We prove that there exist only "nitely many nontrivial graphical t-(v; k; ) designs when k 6 4t=3. This improves a previous result of Betten et al. (Discrete Math. 197/198 (1999) 83–109). c © 2001 Elsevier Science B.V. All rights reserved. We use the notation and terminology of [1] and assume that the reader is familiar with the concept of graphical t-designs [2]. All polynomials in this note a...
متن کاملSome Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we show that all of these designs are indecomposable and therefore they do not lead to large sets of 5(14,6,3) designs. Moreover, they provide the first counterexamples for a conjecture on disjoint t-designs which states...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90351-2